Languages Generated Using an Abstract Catenation
نویسنده
چکیده
We present some results regarding languages that are context-free or regular w.r.t. a non-deterministic binary operation on words that is left variable, only asking a few general properties like associativity. This could be part of a unified approach to intertextuality, the results referring, in particular, to important instances of ”putting texts together” operations like concatenation and shuffle (with all their variations distributed, on trajectories etc.).
منابع مشابه
A Hierarchy of Languages with Catenation and Shuffle
We present basic structures, definitions, normal forms, and a hierarchy of languages based on catenation, shuffle and their iterations, defined by algebraic closure or least fix point solution of systems of equations.
متن کاملContextual Grammars with Distributed Catenation and Shuffle
We introduce a new type of contextual grammars. Instead of considering the catenation operation we use the distributed catenation operation. The contexts are distributed catenated with words from the language, de ning in this way new words from the language. We investigate several properties of the languages generated by distributed catenated contextual grammars. Finally, we also present the re...
متن کاملOn the Generative Capacity of Contextual Grammars with Catenation. Necessary Conditions
In this paper our attention is focused on the study of the properties for some families of contextual languages with catenation (see Fortiş, 1999, also Păun, 1982; Păun, 1997). Also, we are defining and analyzing some new properties characteristic to these families of languages. Using these properties we are able to establish some necessary conditions, and some pumping properties for families o...
متن کاملState Complexity of Orthogonal Catenation
A language L is the orthogonal catenation of languages L1 and L2 if every word of L can be written in a unique way as a catenation of a word in L1 and a word in L2. We establish a tight bound for the state complexity of orthogonal catenation of regular languages. The bound is smaller than the bound for arbitrary catenation.
متن کاملOrdered Catenation Closures and Decompositions of Languages Related to a Language of Derick Wood
We investigate the problem of decomposing a language into a catenation of nontrivial languages, none of which can be decomposed further. In many cases this leads to the operation of an ordered catenation closure, introduced in this paper. We study properties of this operation, as well as its iterations. Special emphasis is on laid on ordered catenation closures of finite languages. It is also s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Grammars
دوره 7 شماره
صفحات -
تاریخ انتشار 2004